Generating Random Orthogonal Polygons
نویسندگان
چکیده
We propose two different methods for generating random orthogonal polygons with a given number of vertices. One is a polynomial time algorithm and it is supported by a technique we developed to obtain polygons with an increasing number of vertices starting from a unit square. The other follows a constraint programming approach and gives great control on the generated polygons. In particular, it may be used to find all n-vertex orthogonal polygons with no collinear edges that can be drawn in an n 2 × n 2 grid, for small n, with symmetries broken.
منابع مشابه
A Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملAutomatic Generation of 3D Building Models with General Shaped Roofs by Straight Skeleton Computation
3D city models are important in several fields, such as urban planning and gaming industries. However, enormous time and labor has to be consumed to create these 3D models, using a 3D modeling software such as 3ds Max or SketchUp. In order to automate laborious steps, we are proposing a GIS and CG integrated system for automatically generating 3D building models, based on building polygons (bui...
متن کاملGenerating Sunflower Random Polygons on a Set of Vertices
Abstract Generating random polygons problem is important for verification of geometric algorithms. Moreover, this problem has applications in computing and verification of time complexity for computational geometry algorithms such as Art Gallery. Since it is often not possible to get real data, a set of random data is a good alternative. In this paper, a heuristic algorithm is proposed for gene...
متن کاملQuadratic-Time Linear-Space Algorithms for Generating Orthogonal Polygons with a Given Number of Vertices
We propose Inflate-Paste – a new technique for generating orthogonal polygons with a given number of vertices from a unit square based on gluing rectangles. It is dual to Inflate-Cut – a technique we introduced in [12] that works by cutting rectangles.
متن کاملThree Heuristic Algorithms for Generation of Random
and computational geometry is the generation of random polygons. practical evaluation of algorithms that operate on polygons, where it is necessary to check determine the actual CPU experimentally. To this time, no polynomial known for the random generation of polygons with a uniform distribution presented for generating random polygons using a set of random vertices using
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003